翻訳と辞書 Words near each other ・ Degree of Honor Protective Association ・ Degree of ionization ・ Degree of isochronous distortion ・ Degree of parallelism ・ Degree of Pocahontas ・ Degree of polarization ・ Degree of polymerization ・ Degree of reaction ・ Degree of saturation ・ Degree of saturation (traffic) ・ Degree of start-stop distortion ・ Degree of truth ・ Degree of unsaturation ・ Degree programmes of the University of Groningen ・ Degree symbol ・ Degree-constrained spanning tree ・ Degree-preserving randomization ・ Degreed ・ Degrees north ・ Degrees of Certainty ・ Degrees of Connection ・ Degrees of Eastern Orthodox monasticism ・ Degrees of freedom ・ Degrees of freedom (mechanics) ・ Degrees of freedom (physics and chemistry) ・ Degrees of freedom (statistics) ・ Degrees of freedom problem ・ Degrees of glory ・ Degrees of the University of Oxford ・ Degrees-R-Us Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Degree-constrained spanning tree ： ウィキペディア英語版 Degree-constrained spanning tree In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant ''k''. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular ''k''. ==Formal definition== Input: ''n''-node undirected graph G(V,E); positive integer ''k'' ≤ ''n''. Question: Does G have a spanning tree in which no node has degree greater than ''k''? 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Degree-constrained spanning tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.